A Discovering Social Circles in Ego Networks
نویسندگان
چکیده
People’s personal social networks are big and cluttered, and currently there is no good way to automatically organize them. Social networking sites allow users to manually categorize their friends into social circles (e.g. ‘circles’ on Google+, and ‘lists’ on Facebook and Twitter), however they are laborious to construct and must be updated whenever a user’s network grows. In this paper, we study the novel task of automatically identifying users’ social circles. We pose this task as a multi-membership node clustering problem on a user’s ego-network, a network of connections between her friends. We develop a model for detecting circles that combines network structure as well as user profile information. For each circle we learn its members and the circle-specific user profile similarity metric. Modeling node membership to multiple circles allows us to detect overlapping as well as hierarchically nested circles. Experiments show that our model accurately identifies circles on a diverse set of data from Facebook, Google+, and Twitter, for all of which we obtain hand-labeled ground-truth.
منابع مشابه
An Edge-based Clustering Algorithm to Detect Social Circles in Ego Networks
Organizing users’ friends in personal social networks, i.e., ego networks, into circles is an important task for online social networks. Social networking sites allow users to manually categorize their friends into social circles. However, it is time consuming and does not update automatically as a user adds more friends. In this paper, we propose an edge-based clustering algorithm to detect so...
متن کاملLearning Social Circles in Ego Networks based on Multi-View Social Graphs
Automatic social circle detection in ego-networks is becoming a fundamentally important task for social network analysis, which can be used for privacy protection or interest group recommendation. So far, most studies focused on how to detect overlapping circles or how to perform detection using both network structure and its node profiles. This paper asks an orthogonal research question: how t...
متن کاملLearning to Discover Social Circles in Ego Networks
Our personal social networks are big and cluttered, and currently there is no good way to organize them. Social networking sites allow users to manually categorize their friends into social circles (e.g. ‘circles’ on Google+, and ‘lists’ on Facebook and Twitter), however they are laborious to construct and must be updated whenever a user’s network grows. We define a novel machine learning task ...
متن کاملAn Automated System for Discovering Neighborhood Patterns in Ego Networks
Generally, social network analysis has often focused on the topology of the network without considering the characteristics of individuals involved in them. Less attention is given to study the behavior of individuals, considering they are the basic entity of a graph. Given a mobile social network graph, what are good features to extract key information from the nodes? How many distinct neighbo...
متن کاملDiscovering groups of key potential customers in social networks: A multi-objective optimization model
Nowadays, the popularity of social networks as marketing tools has brought a deal of attention to social networks analysis (SNA). One of the well-known Problems in this field is influence maximization problems which related to flow of information within networks. Although, the problem have been considered by many researchers, the concept behind of this problem has been used less in business con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013